Hierarchical Agglomerative Cluster Analysis Applied to WIBS 5-Dimensional Bioaerosol Data Sets
نویسندگان
چکیده
Introduction Primary biological aerosol particle (PBAP) classification requires discrimination of particles various diverse sources which may have wide reaching effects in the atmosphere. In order to predict these effects under future emissions scenarios it is useful to be able to identify ambient PBAP concentration. To date, this has largely been achieved by the use of off-line techniques, which, whilst allowing accurate identification of different aerosols, are labour intensive and have poor time resolution. To improve on this we have investigated the use of hierarchical agglomerative (HA) cluster analysis applied to single-particle multi-spatial (5-D) datasets comprising optical diameter, particle asymmetry and three induced fluorescence waveband measurements, from two commonly used dual Waveband Integrated Bioaerosol Spectrometers (WIBS), (Kaye et al., 2005). We show that HA cluster analysis, without the need for any a-priori assumptions concerning the expected aerosol types, can reduce the level of subjectivity compared to the more standard analysis approaches for multiparameter aerosol measurements. Methods We use two WIBS– a model 3 and a model 4 (Gabey et al., 2011). In both models the single particle elastic scattering intensity (at 633 nm) is used to infer particle optical-equivalent diameter, DO. A quadrant PMT measures the variation in azimuthal scattering and hence provides a particle asymmetry factor, AF. This measurement triggers pulses from filtered xenon flash-lamps at 280 nm and 370 nm, designed to excite tryptophan and NAD(P)H molecules within the particle. Fluorescence is measured in two wavelength regimes, FL1 & FL2 providing three fluorescence channels; FL1 & FL2 following the 280 nm excitation and FL2 following the 370 nm excitation. The FL1 and FL2 fluorescence detection regimes overlap spectrally in the WIBS3, but have been separated in the WIBS4. A software tool (WIBS Analysis Program, WASP) was developed that applies the averagelinkage HA-cluster analysis algorithm (Everitt, 1993, Robinson et al. 2012) to WIBS data. Average-linkage defines the two most similar clusters as those with the smallest distance across an !-dimensional space, where ! is the number of particle diagnostics. The distance between two clusters is defined as the average squared Euclidian distance between all possible pairs of particles, or
منابع مشابه
Divisive Hierarchical Clustering with K-means and Agglomerative Hierarchical Clustering
To implement divisive hierarchical clustering algorithm with K-means and to apply Agglomerative Hierarchical Clustering on the resultant data in data mining where efficient and accurate result. In Hierarchical Clustering by finding the initial k centroids in a fixed manner instead of randomly choosing them. In which k centroids are chosen by dividing the one dimensional data of a particular clu...
متن کاملEfficient Clustering and Matching for Object Class Recognition
In this paper we address the problem of building object class representations based on local features and fast matching in a large database. We propose an efficient algorithm for hierarchical agglomerative clustering. We examine different agglomerative and partitional clustering strategies and compare the quality of obtained clusters. Our combination of partitional-agglomerative clustering give...
متن کاملAn Experimental Study on Content Based Image Retrieval Based On Number of Clusters Using Hierarchical Clustering Algorithm
Nowadays the content based image retrieval (CBIR) is becoming a source of exact and fast retrieval. CBIR presents challenges in indexing, accessing of image data and how end systems are evaluated. Data clustering is an unsupervised method for extraction hidden pattern from huge data sets. Many clustering and segmentation algorithms both suffer from the limitation of the number of clusters speci...
متن کاملA Relative Approach to Hierarchical Clustering
This paper presents a new approach to agglomerative hierarchical clustering. Classical hierarchical clustering algorithms are based on metrics which only consider the absolute distance between two clusters, merging the pair of clusters with highest absolute similarity. We propose a relative dissimilarity measure, which considers not only the distance between a pair of clusters, but also how dis...
متن کاملThe Adaptive Mean-Linkage Algorithm: A Bottom-Up Hierarchical Cluster Technique
In this paper a variant of the classical hierarchical cluster analysis is reported. This agglomerative (bottom-up) cluster technique is referred to as the Adaptive Mean-Linkage Algorithm. It can be interpreted as a linkage algorithm where the value of the threshold is conveniently up-dated at each interaction. The superiority of the adaptive clustering with respect to the average-linkage algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012